Learning with continuous experts using drifting games
نویسندگان
چکیده
منابع مشابه
Learning with Continuous Experts Using Drifting Games
We consider the problem of learning to predict as well as the best in a group of experts making continuous predictions. We assume the learning algorithm has prior knowledge of the maximum number of mistakes of the best expert. We propose a new master strategy that achieves the best known performance for online learning with continuous experts in the mistake bounded model. Our ideas are based on...
متن کاملContinuous Drifting Games
We combine the results of [5] and [3] and derive a continuous variant of a large class of drifting games. Our analysis furthers the understanding of the relationship between boosting, drifting games and Brownian motion and yields a differential equation that describes the core of the problem.
متن کاملLearning in real-time in repeated games using experts
Despite much progress, state-of-the-art learning algorithms for repeated games still often require thousands of moves to learn effectively – even in simple games. Our goal is to find algorithms that learn to play effective strategies in tens of moves in many games when paired against various associates. Toward this end, we describe a new meta-algorithm designed to increase the learning speed an...
متن کاملPolicy Learning for Continuous Space Security Games using Neural Networks
A wealth of algorithms centered around (integer) linear programming have been proposed to compute equilibrium strategies in security games with discrete states and actions. However, in practice many domains possess continuous state and action spaces. In this paper, we consider a continuous space security game model with infinite-size action sets for players and present a novel deep learning bas...
متن کاملLearning with a Drifting Target Concept
We study the problem of learning in the presence of a drifting target concept. Specifically, we provide bounds on the error rate at a given time, given a learner with access to a history of independent samples labeled according to a target concept that can change on each round. One of our main contributions is a refinement of the best previous results for polynomial-time algorithms for the spac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2010
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2010.04.004